The Satisfiability Problem for Boolean Set Theory with a Choice Correspondence
نویسندگان
چکیده
منابع مشابه
The Satisfiability Problem for Boolean Set Theory with a Choice Correspondence
Given a setU of alternatives, a choice (correspondence) onU is a contractive map c defined on a family Ω of nonempty subsets ofU . Semantically, a choice c associates to each menu A ∈ Ω a nonempty subset c(A) ⊆ A comprising all elements of A that are deemed selectable by an agent. A choice on U is total if its domain is the powerset of U minus the empty set, and partial otherwise. According to ...
متن کاملThe satisfiability problem for Boolean set theory with a choice correspondence (Extended version)
Given a setU of alternatives, a choice (correspondence) onU is a contractive map c defined on a family Ω of nonempty subsets ofU . Semantically, a choice c associates to each menu A ∈ Ω a nonempty subset c(A) ⊆ A comprising all elements of A that are deemed selectable by an agent. A choice on U is total if its domain is the powerset of U minus the empty set, and partial otherwise. According to ...
متن کاملGeneralizing Boolean Satisfiability II: Theory
This is the second of three planned papers describing zap, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers. The fundamental idea underlying zap is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to def...
متن کاملSolving the Satisfiability Problem through Boolean Networks
$EVWUDFW. In this paper we present a new approach to solve the satisfiability problem (SAT), based on boolean networks (BN). We define a mapping between a SAT instance and a BN, and we solve SAT problem by simulating the BN dynamics. We prove that BN fixed points correspond to the SAT solutions. The mapping presented allows to develop a new class of algorithms to solve SAT. Moreover, this new a...
متن کاملThe Boolean SATisfiability Problem in Clifford algebra
We present a formulation of the Boolean Satisfiability Problem in spinor language that allows to give a necessary and sufficient condition for unsatisfiability. With this result we outline an algorithm to test for unsatisfiability with possibly interesting theoretical properties.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2017
ISSN: 2075-2180
DOI: 10.4204/eptcs.256.5